Dual dynamic programming for linear production/inventory systems
نویسندگان
چکیده
منابع مشابه
Stable Dual Dynamic Programming
Recently, we have introduced a novel approach to dynamic programming and reinforcement learning that is based on maintaining explicit representations of stationary distributions instead of value functions. In this paper, we investigate the convergence properties of these dual algorithms both theoretically and empirically, and show how they can be scaled up by incorporating function approximation.
متن کاملRobust Dual Dynamic Programming
Multi-stage robust optimization problems, where the decision maker can dynamically react to consecutively observed realizations of the uncertain problem parameters, pose formidable theoretical and computational challenges. As a result, the existing solution approaches for this problem class typically determine suboptimal solutions under restrictive assumptions. In this paper, we propose a robus...
متن کاملBATCH TRANSFERRING IN PRODUCTIONINVENTORY SYSTEMS
In most production-inventory systems, the products are transferred from the production centre to the inventory (warehouse) in subbatchs rather than one at a time. In this paper, mathematical models of such systems for both deterministic and stochastic cases of demand are developed and analysed. Comparison of these new models with the EBQ model shows a considerable loss when applying the ru...
متن کاملPrimal-Dual Enumeration for Multiparametric Linear Programming
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs (pLPs) and solved explicitly offline. Several algorithms have recently been proposed in the literature that solve these pLPs in a fairly efficient manner, all of which have as a base operation the computation and removal of redundant constraints. For many problems, it is th...
متن کاملPrimal - dual methods for linear programming
Many interior-point methods for linear programming are based on the properties of the logarithmic barrier function. After a preliminary discussion of the convergence of the (primal) projected Newton barrier method, three types of barrier method are analyzed. These methods may be categorized as primal, dual and primal-dual, and may be derived from the application of Newton’s method to different ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1990
ISSN: 0898-1221
DOI: 10.1016/0898-1221(90)90146-b